Relational Programming in Libra
نویسنده
چکیده
Libra is a general-purpose programming language based on the algebra of binary relations. It attempts to unify functional and logic programming, retaining the advantages of both, and avoiding some of the problems. It has all the features needed of a programming language, and a straightforward semantic interpretation. Since program speciications are easily expressed as relations, it ooers a simple path from a speciication to a program and from the program to its proof of correctness. The algebra of binary relations has several operators whose eeects are like those of familiar procedural language constructs, for example, relational composition is analogous to sequential execution. The Libra language is illustrated by its application to a simple programming exercise. Some conclusions are drawn.
منابع مشابه
TCP Libra : Exploring RTT-Fairness for TCP
The majority of Internet users rely on the Transmission Control Protocol (TCP) to download large multimedia files from remote servers (e.g. P2P file sharing). TCP has been advertised as a fair-share protocol. However, when session round-trip-times (RTTs) radically differ from each other, the share (of the bottleneck link) may be anything but fair. This motivates us to explore a new TCP, TCP Lib...
متن کاملIT: Machine Independent Programming on Hierarchically Nested Machines
APA Citation: Yanhaona, M & Grimshaw, A.(2016). IT: Machine Independent Programming on Hierarchically Nested Machines. University of Virginia Dept. of Computer Science Tech Report. Retrieved from http://libra.virginia.edu/catalog/libra-oa:10931 Accessed: November 21, 2017 Permanent URL: http://libra.virginia.edu/catalog/libra-oa:10931
متن کاملPosynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملLinear programming on SS-fuzzy inequality constrained problems
In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar family of t-norms. Schweizer-Sklar family of t-norms is a parametric family of continuous t-norms, which covers the whole spectrum of t-norms when the parameter is changed...
متن کاملOn the optimization of Dombi non-linear programming
Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi...
متن کامل